Efficiently Decodable Codes for the Binary Deletion Channel
نویسندگان
چکیده
In the random deletion channel, each bit is deleted independently with probability p. For the random deletion channel, the existence of codes of rate (1− p)/9, and thus bounded away from 0 for any p < 1, has been known. We give an explicit constructionwith polynomial time encoding and deletion correction algorithms with rate c0(1 − p) for an absolute constant c0 > 0.
منابع مشابه
Lecture 17 : Feedback , Joint Source Channel Coding , Continuous Channel
If we consider codes that are not necessarily uniquely decodable, then we can encode above the information capacity of the channel. It is important to note however that the probability of error for non-uniquely decodable codes when transmitting strings of source symbols can never approach 0. Consider the following example, we have a binary symmetric channel with cross over problem as shown in F...
متن کاملConstruction of Uniquely Decodable Codes for the Two-User Binary Adder Channel
A construction of uniquely decodable codes for the two-user binary adder channel is presented. The rates of the codes obtained by this construction are greater than the rates guaranteed by the Coebergh van den Braak and van Tilborg construction and these codes can be used with simple encoding and decoding procedures.
متن کاملFinite-Dimensional Bounds on m and Binary LDPC Codes With Belief Propagation Decoders
This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of m and binary low-density parity-check (LDPC) codes, assuming belief propagation decoding on memoryless channels. A concrete framework is presented, admitting systematic searches for new bounds. Two noise measures are considered: the Bhattacharyya noise parameter and the soft bit value for a maximum a post...
متن کاملFinite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders: Stability Conditions on Zm Codes and Cutoff Rate Analysis on Non-symmetric Binary Channels
This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Z m and binary LDPC codes, assuming belief propagation decoding on memoryless channels. Two noise measures will be considered: the Bhattacharyya noise parameter and the soft bit value for a MAP decoder on the uncoded channel. For Z m LDPC codes, an iterative m-dimensional bound is derived for m-ary-input/...
متن کاملFinite State Machine Binary Entropy Coding
A method of universal binary entropy coding using simple state machines is presented. We provide a natural rationale for the use of state machines. We discuss the building of state machines which produce uniquely decodable bit streams. Some state machines implement known codes, while others implement finite or even infinite variable length to variable length codes. Once a decodable state machin...
متن کامل